Matching 2-lattice polyhedra: finding a maximum vector
نویسندگان
چکیده
منابع مشابه
Matching 2-lattice polyhedra: finding a maximum vector
Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network 3ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for #nding a maximum cardinality vector in a matching 2-lattice polyhedron. c © 2001 Elsevier Science B.V. All rights reserved.
متن کامل2-Lattice Polyhedra: Duality
This is the first in a series of papers that explores a class of polyhedra we call 2-lattice polyhedra. 2-Lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyh...
متن کاملA simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of length at most three in a weighted simple graph, which we call the weighted trianglefree 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., gr...
متن کاملFinding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a family U of vertex subsets, a 2-matching F is called U-feasible if, for each U ∈ U , F contains at most |U | − 1 edges in the subgraph induced by U . Our framework includes C≤k-free 2-matchings, i.e., 2-matchings without cycles of at most k edges, and 2-factors covering prescribe...
متن کاملLattice closures of polyhedra
Given P ⊂ R, a mixed integer set P I = P ∩ (Z × Rn−t), and a k-tuple of n-dimensional integral vectors (π1, . . . , πk) where the last n− t entries of each vector is zero, we consider the relaxation of P I obtained by taking the convex hull of points x in P for which π 1 x, . . . , π T k x are integral. We then define the k-dimensional lattice closure of P I to be the intersection of all such r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00219-3